Optimizing iterative decoding of low-density parity check codes on programmable pipelined parallel architectures
نویسندگان
چکیده
1) Introduction Iterative decoding offers a practical way for implementing LDPC codes. LDPC code is defined by a sparse MxN parity check matrix H that has 0 entries everywhere except for t c 1’s in each column and t r 1’s in each row, where t c and t r are small numbers and they degrees. Irregular LDPC codes have varying number of t c and t r . An LDPC code can be represented by bipartite graph G=(V,F,E) that has H as its adjacency matrix.
منابع مشابه
Partially-Parallel LDPC Decoder Achieving High-Efficiency Message-Passing Schedule
In this paper, we propose a partially-parallel LDPC decoder which achieves a high-efficiency message-passing schedule. The proposed LDPC decoder is characterized as follows: (i) The column operations follow the row operations in a pipelined architecture to ensure that the row and column operations are performed concurrently. (ii) The proposed parallel pipelined bit functional unit enables the c...
متن کاملTradeoff Analysis and Architecture Design of High Throughput Irregular LDPC Decoders
Low density parity check (LDPC) codes have attracted significant research interest thanks to their excellent error-correcting abilities and high level of processing parallelism. Recent architecture designs of LDPC decoders are mostly based on the block-structured parity check matrices (PCMs) composed of horizontal layers or component codes. Irregular block-structured LDPC codes have very good e...
متن کاملA pipelined semi-parallel LDPC Decoder architecture for DVB-S2
The implementation of an LDPC Decoder for the DVB-S2 standard is a challenging task, specially because of 1) the large parity-check matrices and 2) the iterative decoding algorithm, which may represent a bottleneck within the receiver data flow. This paper presents a pipelined architecture for LDPC decoding based on a semi-parallel implementation of the Minimum-Sum algorithm, a simplification o...
متن کاملTechniques and Architectures for Hazard-Free Semi-Parallel Decoding of LDPC Codes
The layered decoding algorithm has recently been proposed as an efficient means for the decoding of low-density parity-check (LDPC) codes, thanks to the remarkable improvement in the convergence speed (2x) of the decoding process. However, pipelined semi-parallel decoders suffer from violations or “hazards” between consecutive updates, which not only violate the layered principle but also enfor...
متن کاملVLSI Design of a Fully-Parallel High-Throughput Decoder for Turbo Gallager Codes
The most powerful channel coding schemes, namely those based on turbo codes and low-density parity-check (LDPC) Gallager codes, have in common the principle of iterative decoding. However, the relative coding structures and decoding algorithms are substantially different. This paper presents a 2048-bit, rate-1/2 soft decision decoder for a new class of codes known as Turbo Gallager Codes. These...
متن کامل